Queues with correlated service and inter-arrival times and its application to optical buffers
نویسندگان
چکیده
This paper presents an algorithmic procedure to calculate the queue length and delay distribution of customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on the inter-arrival time between himself and his predecessor. Setting up a Markov chain that keeps track of the contents of such a queue will result in a state space explosion as the inter-arrival times of all customers present in the system must be remembered. We avoid these difficulties by making use of the age process. This process keeps track of the “age” of the customer in the service facility. From this process, which we solve by means of matrix analytic methods, we compute the queue length and sojourn time distribution by means of a simple formula and obtain an expression for the stability of the system. We also demonstrate that the D-MAP arrival process can be easily replaced by the more general semi-Markovian arrival process, without any additional computational costs. Queueing systems of this type arise in the domain of synchronous optical buffers. Based on the numerical analysis of such a queueing system, some guidelines for the design of optical buffers are presented. We also show the impact on the numerical results when the cross-correlation that exists between the service and inter-arrival times is neglected.
منابع مشابه
SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملPerformance of correlated queues: the impact of correlated service and inter-arrival times
In this paper, we consider correlated queues where the service time of a packet is strongly correlated with its inter-arrival time due to the finite transmission capacity of input and output links. We present an analytical method to derive the LST (Laplace Stieltjes Transform) of the (actual) waiting time distribution and the system time distribution. To investigate the impact of such correlati...
متن کاملA matrix geometric representation for the queue length distribution of multitype semi-Markovian queues
In this paper we study a broad class of semi-Markovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue and others, as well as queues with correlated inter-arrival and service times. Queues belonging to this class are characterized by a set of matrices of size m and Sengupta showed that its waiting time distribution can be represe...
متن کاملApproximate Analysis of Open Network of GE/GE/m/N Queues with Transfer Blocking
In this paper we describe an approximate method for the analysis of an open network of finite capacity queues. Finite buffer capacities at the nodes introduce blocking of jobs that finish service at a node and find that the destination node is full at that time. When this happens, we assume that the blocked job is held at the server of the queue where it just completed service, blocking that se...
متن کاملOptimal Simulation of Buffer Overflows in - Queueing Systems with Application to ATM Switches*
works is M/M/l queues and Jackson networks, and it is shown how one can find an asymptotically opSimply because of their rarity, the estimation of timal simulation system for simulating buffer overthe statistics of buffer overflows in queueing s y s flows in these systems. H ~ ~ ~ ~ ~ ~ , in con. terns via direct simulation is often very expensive figurations, it is more usual to have systems w...
متن کامل